Comparative study between elephant herding optimization (EHO) and U-turning ant colony optimization (U-TACO) in solving symmetric traveling salesman problem (STSP)
نویسندگان
چکیده
منابع مشابه
Ant Colony Optimization for Solving Traveling Salesman Problem
An ant colony capable of solving the traveling salesman problem (TSP). TSP is NP-hard problem. Even though the problem itself is simple, when the number of city is large, the search space will become extremely large and it becomes very difficult to find the optimal solution in a short time. One of the main ideas of ant algorithms is the indirect communication of a colony of agents, called (arti...
متن کاملModified Ant Colony Optimization for Solving Traveling Salesman Problem
This paper presents a new algorithm for solving the Traveling Salesman Problem (NPhard problem) using pheromone of ant colony depends on the pheromone and path between cites. TSP is a problem in theoretical computer science which is very hard to solve a number of real-world problems can be formalized as TSP problems, and ants of the colony are able to generate successively shorter feasible tour...
متن کاملSolving Traveling Salesman Problem through Optimization Techniques Using Genetic Algorithm and Ant Colony Optimization
Swarm robotic is a new research area in the domain of Artificial intelligence. Particularly, the swarm robot concept is adopted from Mother Nature that combines small robots in a group to solve a particular problem. This work presents decentralization of swarm robots along-with their methods of optimization, development, applications and implementation in real life domain. It also solves the tr...
متن کاملParallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a ...
متن کاملNew Approach for Solving Dynamic Traveling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization
Dynamic travelling salesman problem (DTSP) is one of the optimization issues which it is not solvable with classical methods. To solve this problem, various solutions in the literature can be seen that each has advantages and disadvantages. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) have been good to solve the DTSP. In this paper, we highlight a new algorithm by combining genetic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Computer Science & Technology
سال: 2019
ISSN: 2227-4332
DOI: 10.14419/jacst.v8i2.29403